perm filename CONCUR[S80,JMC] blob
sn#501944 filedate 1980-04-02 generic text, type C, neo UTF8
COMMENT ⊗ VALID 00002 PAGES
C REC PAGE DESCRIPTION
C00001 00001
C00002 00002 Formaliization of concurrent events
C00004 ENDMK
C⊗;
Formaliization of concurrent events
occurred(event,time)
while(event) ε times
We need names for events such as "McCarthy's intended trip to Russia
in April 1980".
time1 < (precedes) time2
time1 ⊂ (is included in) time2
time1 ∩ time2 (what if null?)
time1 ∪ time2 (a bit problematical since it suggests non
contiguous times)
Perhaps times are just events but deprived of content except for the
set of times.
Non-interacting events. There are defaults. Events are
presumed not to interact unless there are interactions.
Why aren't there good logical puzzles involving concurrent events?
We might axiomatize some rules like "It isn't permissible to be
in the room while the reactor is on.
It isn't permissible for a train to enter a block while another
train is in it.
Maybe the dining philosophers is worth discussing. What about
the dining philosophers?
Planning a trip or a date or manipulating a wife and mistress.
Maybe a puzzle involving a wife and two mistresses could be
concocted.